Constructing 2-Arc-Transitive Covers of Hypercubes
نویسندگان
چکیده
منابع مشابه
Almost Covers Of 2-Arc Transitive Graphs
Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B with block size v. Let ΓB be the quotient graph of Γ relative to B and Γ [B,C] the bipartite subgraph of Γ induced by adjacent blocks B,C of B. In this paper we study such graphs for which ΓB is connected, (G,2)-arc transitive and is almost covered by Γ in the sense that Γ [B,C] is a matching of v−1≥2 edge...
متن کاملArc-transitive regular cyclic covers of the complete bipartite graph
Characterizing regular covers of edge-transitive or arc-transitive graphs is currently a hot topic in algebraic graph theory. In this paper, we will classify arctransitive regular cyclic covers of the complete bipartite graph Kp,p for each odd prime p. The classification consists of four infinite families of graphs. In particular, such covers exist for each odd prime p. The regular elementary a...
متن کاملArc-transitive abelian regular covers of cubic graphs
Quite a lot of attention has been paid recently to the construction of edgeor arc-transitive covers of symmetric graphs. In most cases, the approach has involved voltage graph techniques, which are excellent for finding regular covers in which the group of covering transformations is either cyclic or elementary abelian, or more generally, homocyclic, but are not so easy to use when the covering...
متن کاملArc-Transitive Dihedral Regular Covers of Cubic Graphs
A regular covering projection is called dihedral or abelian if the covering transformation group is dihedral or abelian. A lot of work has been done with regard to the classification of arc-transitive abelian (or elementary abelian, or cyclic) covers of symmetric graphs. In this paper, we investigate arc-transitive dihedral regular covers of symmetric (arc-transitive) cubic graphs. In particula...
متن کاملArc-transitive abelian regular covers of the Heawood graph
In this sequel to the paper ‘Arc-transitive abelian regular covers of cubic graphs’, all arc-transitive abelian regular covers of the Heawood graph are found. These covers include graphs that are 1-arc-regular, and others that are 4-arc-regular (like the Heawood graph). Remarkably, also some of these covers are 2-arc-regular.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2019
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-019-02049-8